Search results for "Bottleneck traveling salesman problem"

showing 1 items of 1 documents

NP-completeness of the hamming salesman problem

1985

It is shown that the traveling salesman problem, where cities are bit strings with Hamming distances, is NP-complete.

Discrete mathematicsComputer Networks and CommunicationsApplied MathematicsComputer Science::Neural and Evolutionary ComputationHamming distanceComputer Science::Computational ComplexityTravelling salesman problemCombinatoricsHigh Energy Physics::TheoryComputational MathematicsCompleteness (order theory)Computer Science::Data Structures and AlgorithmsNP-completeBottleneck traveling salesman problemHamming codeSoftwareComputer Science::Information TheoryMathematicsBIT
researchProduct